-
1 однонаправленный граф
Русско-английский физический словарь > однонаправленный граф
-
2 однонаправленный граф
Русско-английский словарь по электронике > однонаправленный граф
-
3 однонаправленный граф
Русско-английский словарь по радиоэлектронике > однонаправленный граф
-
4 однонаправленный граф
Makarov: one-way graphУниверсальный русско-английский словарь > однонаправленный граф
-
5 сниматься
несов. - снима́ться, сов. - сня́ться1) (поддаваться снятию, удаляться) go offсапоги́ не снима́ются — the boots won't go off
2) (начинать движение, перемещение) moveснима́ться с ме́ста — move on, start moving
снима́ться с я́коря — weigh anchor ['æŋkə]; get under way
снима́ться с ме́ли — get afloat again
3)снима́ться с учёта — be struck / crossed off the register, be dropped from the roster
4) фото, кино be photographed; (фотографироваться тж.) have one's picture / photo(graph) taken; ( играть в кино) act in a filmснима́ется кино́ — a film is being made / shot
собы́тия снима́ются на плёнку — the events are (being) filmed
5) жарг. ( быть готовым к знакомству и интимной связи) let oneself be picked upэ́ти же́нщины легко́ снима́ются — these women can be easily picked up
См. также в других словарях:
One-way quantum computer — The one way or measurement based quantum computer is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is one way because the… … Wikipedia
One-Shot Entanglement-Enhanced Classical Communication — In the theory of quantum communication, it is well known that entanglement cannot increase the capacity of a classical communication channel in the sense of Shannon, that is, for an i.i.d. (independent and identically distributed) protocol.… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
-graph — comb. form forming nouns and verbs meaning: 1 a thing written or drawn etc. in a specified way (autograph; photograph). 2 an instrument that records (heliograph; seismograph; telegraph). * * * ˌgraf, aa(ə)f, aif, ȧf noun combining form ( s)… … Useful english dictionary
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… … Wikipedia
One-in-three 3SAT — In computational complexity theory, one in three 3SAT (also known variously as 1 in 3 SAT and exactly 1 3SAT) is an NP complete problem. The problem is a variant of the 3 satisfiability problem (3SAT). Like 3SAT, the input instance is a… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia